// Largest prime factor of 600851475143

void problem3(void){

	int i=2; int j; int count = 0;
	int num = 60;

	printf("num = %d\n", num);

	// 1) Prime numbers lower than 100

	while(i<=100){

		for(j=1;j<=i;j++){

			if(i%j == 0){

				count++;

			}

		}

		if(!(count>2)){
			// (j-1) is prime
			if(num%(j-1)==0){ // check if num is multiple of j-1

				num = num/(j-1); printf("num = %d * %d\n",num,j-1);

			}

		}

		count=0; i++;

	}

	// 1)

}
